Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false

In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ? such that $\mathsf{P}(G_n??)$ does not converge as $n\to \infty$ (here, the probability distribution is uniform over the set of all graphs on the labeled set of vertices $\{1,\dots ,n\}$). In the same paper, he conjectured that, for EMSO sentences with 2 first order variables, the zero-one law holds. In this paper, we disprove this conjecture.     

Unconditionally Superclose Analysis of a New Mixed Finite Element Method for Nonlinear Parabolic Equation

This paper develops a framework to deal with the unconditional superclose analysis of nonlinear parabolic equation. Taking the finite element pair $Q_{11}/Q_{01} × Q_{10}$ as an example, a new mixed finite element method (FEM) is established and the $τ$ -independent superclose results of the original variable $u$ in $H^1$-norm and the flux variable $\mathop{q} \limits ^{\rightarrow}= −a(u)∇u$ in $L^2$-norm are deduced ($τ$ is the temporal partition parameter). A key to our analysis is an error splitting technique, with which the time-discrete and the spatial-discrete systems are constructed, respectively. For the first system, the boundedness of the temporal errors is obtained. For the second system, the spatial superclose results are presented unconditionally, while the previous literature always only obtain the convergent estimates or require certain time step conditions. Finally, some numerical results are provided to confirm the theoretical analysis, and show the efficiency of the proposed method.     

On the Differential Polynomial of a Graph

We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial B(G; x) :=∑?(G)k=-nB_k(G) x~(n+k), where B_k(G) denotes the number of vertex subsets of G with differential equal to k. We state some properties of B(G;x) and its coefficients.In particular, we compute the differential polynomial for complete, empty, path, cycle, wheel and double star graphs. We also establish some relationships between B(G; x) and the differential polynomials of graphs which result by removing, adding, and subdividing an edge from G.     

In situ green synthesis of Cu‐Ni bimetallic nanoparticles supported on reduced graphene oxide as an effective and recyclable catalyst for the synthesis of N‐benzyl‐N‐aryl‐5‐amino‐1H‐tetrazoles

In the present work, for the first time we have designed a novel approach for the synthesis of N‐benzyl‐N‐aryl‐5‐amino‐1H‐tetrazoles using reduced graphene oxide (rGO) decorated with Cu‐Ni bimetallic nanoparticles (NPs). In situ synthesis of Cu/Ni/rGO nanocomposite was performed by a cost efficient, surfactant‐free and environmentally benign method using Crataegus azarolus var. aronia L. leaf extract as a stabilizing and reducing agent. Phytochemicals present in the extract can be used to reduce Cu²⁺ and Ni²⁺ ions and GO to Cu NPs, Ni NPs and rGO, respectively. Analyses by means of FT‐IR, UV–Vis, EDS, TEM, FESEM, XRD and elemental mapping confirmed the Cu/Ni/rGO formation and also FT‐IR, NMR, and mass spectroscopy as well as elemental analysis were used to characterize the tetrazoles. The Cu/Ni/rGO nanocomposite showed the superior catalytic activity for the synthesis of N‐benzyl‐N‐aryl‐5‐amino‐1H‐tetrazoles within a short reaction time and high yields. Furthermore, this protocol eliminates the need to handle HN₃.     

Optimal packings of two to four equal circles on any flat torus

We find explicit formulas for the radii and locations of the circles in all the optimally dense packings of two, three or four equal circles on any flat torus, defined to be the quotient of the Euclidean plane by the lattice generated by two independent vectors. We prove the optimality of the arrangements using techniques from rigidity theory and topological graph theory.     

Ends,tangles and critical vertex sets

We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose ?₀‐tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of and our construction of , we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel.     

Carbon Paste Composite with Co3O4 as a New Electrochemical Sensor for the Detection of Allura Red by Reduction

The detection of Allura red (AR) by electrochemical reduction using a different electrode from the conventional mercury electrode is presented. A carbon paste with cobalt (II, III) oxide composite electrode (CoO_x/CPE) is reported for the first time for the detection of AR. Moreover, others dyes such as tartrazine (TZ), sunset yellow (SY), amaranth (AM), Ponceaut 4‐R (P‐4R), and Sudan (SD) as well as pharmaceutical agents such as paracetamol (PMC) that are present in samples that contained AR did not show a reduced signal between 0.0 and ?0.3 V, which is the potential range where AR reduction was observed. The surface electroactivity was studied using cyclic voltammetry (CV), electrochemical impedance spectroscopy (EIS) and scanning electron microscopy (SEM). The presence of CoO_X increased the cathodic peak current for AR by more than 50 % and 65 % via CV and square wave voltammetry (SWV), respectively, compared with an unmodified carbon paste electrode. Under the optimal parameters, (pH=3.0, accumulation time (t_ACC)=60 s and accumulation potential (E_ACC)=0.50 V), the detection limit for AR was 0.05 μmol L^?1. The new sensor was sensitive and stable for the detection of AR. Moreover, it was easily manufactured and very convenient for food samples such as soft and isotonic drinks as well as chili sauce.     

Erratum: The average degree of an edge-chromatic critical graph II

In the article “The average degree of an edge-chromatic critical graph II” by Douglas R. Woodall (J. Graph Theory 56 (2007), 194-218), it was claimed that the average degree of an edge-chromatic critical graph with maximum degree $\mathrm{\Delta }$ is at least $\text{◂⋅▸}\frac{2}{3}\left(\mathrm{\Delta }+1\right)$ if $\mathrm{\Delta }⩾2$, at least $\text{◂+▸}\frac{2}{3}\mathrm{\Delta }+1$ if $\mathrm{\Delta }⩾8$, and at least $\text{◂⋅▸}\frac{2}{3}\left(\mathrm{\Delta }+2\right)$ if $\mathrm{\Delta }⩾15$. Unfortunately there were mistakes in the proof of the last two of these results, which are now proved only if $\mathrm{\Delta }⩾18$ and $\mathrm{\Delta }⩾30$, respectively.